A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces

نویسندگان

  • Radu Ioan Boţ
  • Sorin-Mihai Grad
  • Gert Wanka
چکیده

In this paper we work in separated locally convex spaces where we give equivalent statements for the formulae of the conjugate function of the sum of a convex lower-semicontinuous function and the precomposition of another convex lower-semicontinuous function which is also K-increasing with a K-convex K-epi-closed function, where K is a non-empty closed convex cone. These statements prove to be the weakest constraint qualifications given so far under which the formulae for the subdifferential of the mentioned sum of functions are valid. Then we deliver constraint qualifications inspired from them that guarantee some conjugate duality assertions. Two interesting special cases taken from the literature conclude the paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

Two-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints

‎This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints‎. ‎Firstly‎, ‎we consider some lower level constraint qualifications (CQs) for this problem‎. ‎Then‎, ‎under these CQs‎, ‎we derive formula for estimating the subdifferential of its valued function‎. ‎Finally‎, ‎we present some necessary optimality condit...

متن کامل

Characterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints

This paper studies the convex multiobjective optimization problem with vanishing constraints‎. ‎We introduce a new constraint qualification for these problems‎, ‎and then a necessary optimality condition for properly efficient solutions is presented‎. ‎Finally by imposing some assumptions‎, ‎we show that our necessary condition is also sufficient for proper efficiency‎. ‎Our results are formula...

متن کامل

On Subdifferential Calculus for Convex Functions Defined on Locally Convex Spaces

The subdifferential formula for the sum of two convex functions defined on a locally convex space is proved under a general qualification condition. It is proved that all the similar results which are already known can be derivated from the formula.

متن کامل

Mangasarian-Fromovitz and Zangwill Conditions For Non-Smooth Infinite Optimization problems in Banach Spaces

In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are Lipschitz near the optimal solution. Necessary optimality conditions and constraint qualifications in terms of Michel-Penot subdifferential are given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005